The Power of Programs over Monoids in DA
نویسندگان
چکیده
The program-over-monoid model of computation originates with Barrington’s proof that it captures the complexity class NC1. Here we make progress in understanding the subtleties of the model. First, we identify a new tameness condition on a class of monoids that entails a natural characterization of the regular languages recognizable by programs over monoids from the class. Second, we prove that the class known as DA satisfies tameness and hence that the regular languages recognized by programs over monoids in DA are precisely those recognizable in the classical sense by morphisms from QDA. Third, we show by contrast that the well studied class of monoids called J is not tame and we exhibit a regular language, recognized by a program over a monoid from J, yet not recognizable classically by morphisms from the class QJ. Finally, we exhibit a program-length-based hierarchy within the class of languages recognized by programs over monoids from DA. 1998 ACM Subject Classification F.1.1 Models of Computation
منابع مشابه
On the U-WPF Acts over Monoids
Valdis Laan in [5] introduced an extension of strong flatness which is called weak pullback flatness. In this paper we introduce a new property of acts over monoids, called U-WPF which is an extension of weak pullback flatness and give a classification of monoids by this property of their acts and also a classification of monoids when this property of acts implies others. We also show that regu...
متن کامل-torsion free Acts Over Monoids
In this paper firt of all we introduce a generalization of torsion freeness of acts over monoids, called -torsion freeness. Then in section 1 of results we give some general properties and in sections 2, 3 and 4 we give a characterization of monoids for which this property of their right Rees factor, cyclic and acts in general implies some other properties, respectively.
متن کاملOn Regularity of Acts
In this article we give a characterization of monoids for which torsion freeness, ((principal) weak, strong) flatness, equalizer flatness or Condition (E) of finitely generated and (mono) cyclic acts and Condition (P) of finitely generated and cyclic acts implies regularity. A characterization of monoids for which all (finitely generated, (mono) cyclic acts are regular will be given too. We als...
متن کاملAnalysis and Design of High Gain, and Low Power CMOS Distributed Amplifier Utilizing a Novel Gain-cell Based on Combining Inductively Peaking and Regulated Cascode Concepts
In this study an ultra-broad band, low-power, and high-gain CMOS Distributed Amplifier (CMOS-DA) utilizing a new gain-cell based on the inductively peaking cascaded structure is presented. It is created bycascading of inductively coupled common-source (CS) stage and Regulated Cascode Configuration (RGC).The proposed three-stage DA is simulated in 0.13 μm CMOS process. It achieves flat and high ...
متن کاملOn Condition (G-PWP)
Laan in (Ph.D Thesis, Tartu. 1999) introduced the principal weak form of Condition $(P)$ as Condition $(PWP)$ and gave some characterization of monoids by this condition of their acts. In this paper first we introduce Condition (G-PWP), a generalization of Condition $(PWP)$ of acts over monoids and then will give a characterization of monoids when all right acts satisfy this condition. We also ...
متن کامل